Effective target arrangement in a deterministic scale-free graph
نویسندگان
چکیده
منابع مشابه
Effective target arrangement in a deterministic scale-free graph.
We study the random-walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a measure of transport efficiency, is expected to depend sensitively on the position of targets. We consider several spatial arrangements for targets and we calculat...
متن کاملDeterministic Scale-Free Networks
Scale-free networks are abundant in nature, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in...
متن کاملOn the Arrangement Graph
The arrangement graph was proposed as a generalization of the star graph topology. In this paper we investigate the topological properties of the (n, k)-arrangement graph &k. It has been shown that the (n, n 2)arrangement graph An,+2 is isomorphic to the n-alternating group graph AGn In addition, the exact value of average distance of A,,& has been derived.
متن کاملRandom Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and deletes vertices randomly. At time t, with probability α1 > 0 we add a new vertex ut and m random edges incident with ut. The neighbours of ut are chosen with probability proportional to degree. With probability α − α1 ≥ 0 we add m random edges to existing vertices where the endpoints ar...
متن کاملWeighted Scale-Free Random Graph Model
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of three generic mechanisms: (i) networks expand continuously by attaching addition of new vertices, (ii) new vertex wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.011118